Crosscorrelation of m-sequences, exponential sums, bent functions and Jacobsthal sums

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequences, Bent Functions and Jacobsthal Sums

The p-ary function f(x) mapping GF(p) to GF(p) and given by f(x) = Tr4k ( ax + bx ) with a, b ∈ GF(p) and d = p + p − p + 1 is studied with the respect to its exponential sum. In the case when either a (p+1) 6= b +1 or a = b with b 6= 0, this sum is shown to be three-valued and the values are determined. For the remaining cases, the value of the exponential sum is expressed using Jacobsthal sum...

متن کامل

Bilinear Sums with Exponential Functions

Let g = 0,±1 be a fixed integer. Given two sequences of complex numbers (φm) ∞ m=1 and (ψn) ∞ n=1 and two sufficiently large integers M and N , we estimate the exponential sums ∑ p≤M gcd(ag,p)=1 ∑ 1≤n≤N φpψnep (ag ) , a ∈ Z, where the outer summation is taken over all primes p ≤ M with gcd(ag, p) = 1.

متن کامل

On Approximation of Functions by Exponential Sums

We introduce a new approach, and associated algorithms, for the efficient approximation of functions and sequences by short linear combinations of exponential functions with complex-valued exponents and coefficients. These approximations are obtained for a finite but arbitrary accuracy and typically have significantly fewer terms than Fourier representations. We present several examples of thes...

متن کامل

Exponential Sums, Gauss Sums and Cyclic Codes

The dissertation consists of three articles in which the evaluation of certain exponential sums and Gauss sums and bounds for the absolute values of exponential sums are considered. The summary part of the thesis provides interpretations in terms of coding theory for the results obtained in the articles.

متن کامل

Exponential Sums

where we in introduce the standard notation e(x) = exp(2πix). Question 1.1. What is the magnitude of | ∑ x∈S e(x)|? By the trivial bound, we find that | ∑ x∈S e(x)| ≤ N , with equality whenever the terms are all equal. One can of course make the sum much smaller–simply sum the Nth roots of unity. In between these two extremes–completely in phase and maximally out of phase–we should consider wha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cryptography and Communications

سال: 2011

ISSN: 1936-2447,1936-2455

DOI: 10.1007/s12095-011-0048-0